منابع مشابه
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. ...
متن کاملO(f) Bi-Approximation for Capacitated Covering with Hard Capacities
We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph G = (V,E) with a maximum edge size f . Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset such that the demands of the edge...
متن کاملSolving hard set covering problems
We propose a new branch-and-bound algorithm to solve hard instances of set covering problems arising from Steiner triple systems.
متن کاملOn a Class of Covering Problems with Variable Capacities in Wireless Networks
Article history: Received 15 April 2014 Received in revised form 29 September 2014 Accepted 28 October 2014 Available online 4 November 2014
متن کاملFlows with Unit Path Capacities and Related Packing and Covering Problems
Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2006
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539703422479